An Edge Irregular Reflexive k−labeling of Comb Graphs with Additional 2 Pendants

Let G be a connected, simple, and undirrected graph, where V (G) is the vertex set E(G) edge set. k natural numbers. For graph we define total k−labeling ρ such that vertices of are labeled with {0, 2, 4, . , 2kv} edges {1, 3, ke}, = max{2kv, ke}. Total called an irregular reflexive k− labeling if every two distinct have weights, weight defined as sum label incident to this edge. The minimum has strength G. In paper determine some comb graphs.